Entropic nonextensivity as a measure of time series complexity
نویسندگان
چکیده
منابع مشابه
Entropic Nonextensivity as a Measure of Time Series Complexity
Information entropy is applied to the analysis of time series generated by dynamical systems. Complexity of a temporal or spatio-temporal signal is defined as the difference between the sum of entropies of the local linear regions of the trajectory manifold, and the entropy of the globally linearized manifold. When the entropies are Tsallis entropies the complexity is characterized by the value...
متن کاملIncrement Entropy as a Measure of Complexity for Time Series
Entropy has been a common index to quantify the complexity of time series in a variety of fields. Here, we introduce an increment entropy to measure the complexity of time series in which each increment is mapped onto a word of two letters, one corresponding to the sign and the other corresponding to the magnitude. Increment entropy (IncrEn) is defined as the Shannon entropy of the words. Simul...
متن کاملInformation Measure as Time Complexity
The concept of Shannon entropy of random variables was generalized to measurable functions in general, and to simple functions with finite values in particular. It is shown that the information measure of a function is related to the time complexity of search problems concerning the function in question. Formally, given a Turing reduction from a search problem y x f ) ( to another search prob...
متن کاملTime Series Forecasting as a Measure
In this paper, the time series prediction is as a measure. At the same time, the optimal combination forecast using each method can be defined as the actual impact measurement value of true. Effect of its theoretical estimation has error correlation coefficient values. The optimal weighted linear combination is the theoretical prediction which can be proved, also, simple averaging method is lin...
متن کاملPermutation entropy: a natural complexity measure for time series.
We introduce complexity parameters for time series based on comparison of neighboring values. The definition directly applies to arbitrary real-world data. For some well-known chaotic dynamical systems it is shown that our complexity behaves similar to Lyapunov exponents, and is particularly useful in the presence of dynamical or observational noise. The advantages of our method are its simplic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physica A: Statistical Mechanics and its Applications
سال: 2004
ISSN: 0378-4371
DOI: 10.1016/j.physa.2004.04.023